Counting Generalized Orders on Not Necessarily Formally Real Fields

نویسنده

  • RON BROWN
چکیده

The set of classical orderings of a field compatible with a given place from the field to the real numbers is known to be bijective with the set of homomorphisms from the value group of the place into the two element group. This fact is generalized here to the set of “generalized orders” compatible with an “extended absolute value,” i.e., an absolute value allowed to take the value ∞. The set of extensions to a field F of a given generalized order on a subfield of F is computed and this computation is applied to count the number of such extensions that arise from finite degree field extensions of formally p-adic fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On formally real Division Algebras and Quasifields of Rank two

In view of Albert's classical result that the dimension of each ordered, associative proper algebra over its center is necessarily infinite (cf. [1]), it seems not unlikely that a similar statement also holds for the rank of each proper formally real quasifield F, i.e. for the dimension of F over its kernel. Indeed, for some classes of ordered near fields and for ordered quasifields admitting a...

متن کامل

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

On a functional equation for symmetric linear operators on $C^{*}$ algebras

‎Let $A$ be a $C^{*}$ algebra‎, ‎$T‎: ‎Arightarrow A$ be a linear map which satisfies the functional equation $T(x)T(y)=T^{2}(xy),;;T(x^{*})=T(x)^{*} $‎. ‎We prove that under each of the following conditions‎, ‎$T$ must be the trivial map $T(x)=lambda x$ for some $lambda in mathbb{R}$: ‎‎ ‎i) $A$ is a simple $C^{*}$-algebra‎. ‎ii) $A$ is unital with trivial center and has a faithful trace such ...

متن کامل

A Gross-Zagier formula for quaternion algebras over totally real fields

We prove a higher dimensional generalization of Gross and Zagier’s theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves with complex multiplication by two different imaginary quadratic fields K and K′, when the curves are reduced modulo a supersingular prime and its powers. Equi...

متن کامل

A Verified Algorithm Enumerating Event Structures

An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event struct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004